|
In mathematics, the spectral radius of a square matrix or a bounded linear operator is the supremum among the absolute values of the elements in its spectrum, which is sometimes denoted by ρ(·). ==Matrices== Let be the (real or complex) eigenvalues of a matrix . Then its spectral radius is defined as: : The following lemma shows a simple yet useful upper bound for the spectral radius of a matrix: :Lemma. Let with spectral radius and a consistent matrix norm ; then, for each : :: ''Proof'': Let be an eigenvector-eigenvalue pair for a matrix ''A''. By the sub-multiplicative property of the matrix norm, we get: : and since we have : and therefore : The spectral radius is closely related to the behaviour of the convergence of the power sequence of a matrix; namely, the following theorem holds: :Theorem. Let with spectral radius ; then if and only if :: :Moreover, if , is not bounded for increasing values of . ''Proof.'' Assume the limit in question is zero, we will show that . Let be an eigenvector-eigenvalue pair for ''A''. Since we have: : and, since by hypothesis , we must have : which implies |λ| < 1. Since this must be true for any eigenvalue λ, we can conclude ρ(''A'') < 1. Now assume the radius of is less than . From the Jordan normal form theorem, we know that for all , there exist with non-singular and block diagonal such that: : with : where : It is easy to see that : and, since is block-diagonal, : Now, a standard result on the -power of an Jordan block states that, for : : Thus, if then for all . Hence for all we have: : which implies : Therefore, : On the other side, if , there is at least one element in which doesn't remain bounded as k increases, so proving the second part of the statement. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Spectral radius」の詳細全文を読む スポンサード リンク
|